Information-theoretic analysis of watermarking

نویسندگان

  • Pierre Moulin
  • Joseph A. O'Sullivan
چکیده

An information–theoretic analysis of watermarking is presented in this paper. We formulate watermarking as a communication problem with side information at the encoder and decoder and determine the hiding capacity, which upper–bounds the rates of reliable transmission and quantifies the fundamental tradeoff between three quantities: the achievable watermarking rates and the allowed distortion levels for the information hider and the attacker. The hiding capacity is the value of a game between the information hider and the attacker. The optimal attack strategy is the solution of a particular rate-distortion problem, and the optimal hiding strategy is the solution to a channel coding problem. For several important problems, the hiding capacity is the same whether or not the decoder knows the host data set. It is also shown that existing watermarking systems in the literature operate far below capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communication and Information Theory in Watermarking: A Survey

This paper presents a review of some influential work in the area of digital watermarking using communications and information-theoretic analysis. After a brief introduction, some popular approaches are classified into different groups and an overview of various algorithms and analysis is provided. Insights and potential future trends in the area of watermarking theory are discussed.

متن کامل

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

Graph Theoretic Software Watermarks: Implementation, Analysis, and Attacks

This paper presents an implementation of the novel watermarking method proposed by Venkatesan, Vazirani, and Sinha in their recent paper A Graph Theoretic Approach to Software Watermarking. An executable program is marked by the addition of code for which the topology of the control-flow graph encodes a watermark. We discuss issues that were identified during construction of an actual implement...

متن کامل

Waterfilling: a connection between information theoretic and perceptually based watermarking

We present a hybrid approach to image watermarking that exploits results from both information theory and perceptual studies. Towards this purpose we use a waterfilling-type algorithm to establish a connection between information theoretic and perceptually based watermarking. Information theoretic capacity formula for a Gaussian signal over a Gaussian channel is used and some parameters of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000